Deciding Irreducibility/Indecomposability of Feedback Shift Registers is NP-hard
نویسنده
چکیده
Feedback shift registers(FSRs) are a fundamental component in electronics and secure communication. An FSR f is said to be reducible if all the output sequences of another FSR g can also be generated by f and the FSR g has less memory than f . An FSR is said to be decomposable if it has the same set of output sequences as a cascade connection of two FSRs. It is proved that deciding whether FSRs are irreducible/indecomposable is NP-hard.
منابع مشابه
Indecomposability of Polynomials via Jacobian Matrix
Indecomposable polynomials are a special class of absolutely irreducible polynomials. Some improvements of important effective results on absolute irreducibility have recently appeared using Ruppert’s matrix. In a similar way, we show in this paper that the use of a Jacobian matrix gives sharp bounds for the indecomposability problem.
متن کاملChecking the strict positivity of Kraus maps is NP-hard
Basic properties in Perron-Frobenius theory are strict positivity, primitivity, and irreducibility. Whereas for nonnegative matrices, these properties are equivalent to elementary graph properties which can be checked in polynomial time, we show that for Kraus maps the noncommutative generalization of stochastic matrices checking strict positivity (whether the map sends the cone to its interior...
متن کاملIntegral and homothetic indecomposability with applications to irreducibility of polynomials
Being motivated by some methods for construction of homothetically indecomposable polytopes, we obtain new methods for construction of families of integrally indecomposable polytopes. As a result, we find new infinite families of absolutely irreducible multivariate polynomials over any field F . Moreover, we provide different proofs of some of the main results of Gao [2].
متن کاملAlgebraic Feedback Shift Registers
A general framework for the design of feedback registers based on algebra over complete rings is described. These registers generalize linear feedback shift registers and feedback with carry shift registers. Basic properties of the output sequences are studied: relations to the algebra of the underlying ring; synthesis of the register from the sequence (which has implications for cryptanalysis)...
متن کاملAlgebraic Feedback Shift Registers Based on Function Fields
We study algebraic feedback shift registers (AFSRs) based on quotients of polynomial rings in several variables over a finite field. These registers are natural generalizations of linear feedback shift registers. We describe conditions under which such AFSRs produce sequences with various ideal randomness properties. We also show that there is an efficient algorithm which, given a prefix of a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1702.01423 شماره
صفحات -
تاریخ انتشار 2017